Tabu search - Uncharted domains
نویسنده
چکیده
The setting could have come from a Hollywood science fiction movie. A dozen figures, a handful in uniforms of the U.S. Strategic Air Command (SAC) and a slightly larger contingent variously in business suits and in shirtsleeves, were gathered around a large mainframe computer whose blinking lights signaled a run in progress. The computer run — on an early70s behemoth that represented the state-of-the-art of the period—was seeking a response to a scenario of a first wave nuclear strike on the U.S.. Each of us present had a security clearance at the level of Secret or higher. Mine, a lowly Secret clearance, had come via an engagement with the Defense Communications Agency at the other-worldly SAC installation buried beneath Cheyenne Mountain. My involvement in the present project was the result of a labyrinthine trail that had wended its way through my earlier associations with research groups at Carnegie Mellon University and at the University of California, Berkeley to reach me at my present post at the University of Colorado. The computer scenario currently in progress was engaged in testing a new type of search procedure applied to the objective of discovering an appropriate counter to the hypothetical nuclear strike. The conditions surrounding this objective, which hinged on satisfactorily meeting a collection of prioritized sub-goals, were embodied in a complex combinatorial optimization model. For the search routine to be successful, an effective retaliatory response had to be identified in less than 5 minutes. Experience suggested such an undertaking might not be easy. Previous efforts, utilizing a diverse array of approaches implemented by the “shirtsleeves crowd” surrounding me — a computer science and OR group from a California Think Tank organization engaged by SAC for this project — had been unable to generate an effective response in under 47 minutes, and the resulting solution had been deemed marginal. A concerted initiative to remedy this outcome had, reasonably or unreasonably, wound up on my doorstep and confronted me with the challenge of designing an approach that might do better. The California Think Tank group did not conceal their doubts about the likelihood of my pulling this off, and had openly
منابع مشابه
Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملTabu Search and Adaptive Memory Programming— Advances, Applications and Challenges
Tabu search (TS) has provided advances for solving difficult optimization problems in many domains. At the same time, fundamental TS strategies are often not applied as effectively as they might be, and their underlying rationale is often not completely understood. We examine basic concepts and principles of tabu search, emphasizing those that have sometimes led to applying the label "adaptive ...
متن کاملAPPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT
The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...
متن کاملMulti-Objective Tabu Search Algorithm to Minimize Weight and Improve Formability of Al3105-St14 Bi-Layer Sheet
Nowadays, with extending applications of bi-layer metallic sheets in different industrial sectors, accurate specification of each layer is very prominent to achieve desired properties. In order to predict behavior of sheets under different forming modes and determining rupture limit and necking, the concept of Forming Limit Diagram (FLD) is used. Optimization problem with objective functions an...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملTabu search enhanced Markov blanket classifier for high dimensional data sets
Data sets with many discrete variables and relatively few cases arise in health care, ecommerce, information security, text mining, and many other domains. Learning effective and efficient prediction models from such data sets is a challenging task. In this paper, we propose a Tabu Search enhanced Markov Blanket (TS/MB) procedure to learn a graphical Markov Blanket classifier from data. The TS/...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 149 شماره
صفحات -
تاریخ انتشار 2007